package week_01.recursion.Fibonacci;

import java.util.Scanner;

public class Fibonacci {
    public static void main(String[] args) {
        Scanner input= new Scanner(System.in);
        System.out.println("请输入要计算的斐波那契数列的位数:");
        int n=input.nextInt();
        Fibonacci_f ff=new Fibonacci_f();
        System.out.println("第"+n+"位的斐波那契数列的值为:"+ff.fibonacci(n));
    }
}
